A lower bound on the stability region of redundancy-d with FIFO service discipline
نویسندگان
چکیده
Abstract Due to the complex dynamics of systems with redundancy and cancellations, existing results on stability region Redundancy- d (R( )) load balancing policy are scarce limited very special cases respect joint service time distribution tasks. We provide a non-trivial, closed form lower bound R( ) for general distribution. While simulation indicate our is not tight, it provides an easy-to-check performance guarantee.
منابع مشابه
Stability of Multiclass Queueing Networks Under FIFO Service Discipline
In this paper, we rst formally identify a FIFO uid network that corresponds to the queueing network under a rst-in rst-out (FIFO) service discipline, thus complementing the result of Dai (1995a) for the use of the uid model for the stability of a multiclass queueing network under a FIFO service discipline. Then we establish two suucient conditions for the stability of a multiclass FIFO queueing...
متن کاملLower Bound on the Redundancy of PIR Codes
We prove that the redundancy of a k-server PIR code of dimension s is Ω( √ s) for all k > 3. This coincides with a known upper bound of O( √ s) on the redundancy of PIR codes. Moreover, for k = 3 and k = 4, we determine the lowest possible redundancy of k-server PIR codes exactly. Similar results were proved independently byMary Wootters using a different method. Given two binary vectors u = (u...
متن کاملthe effect of consciousness raising (c-r) on the reduction of translational errors: a case study
در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...
15 صفحه اولOn a lower bound for the redundancy of reliable networks with noisy gates
We provide a proof that a logarithmic redundancy factor is necessary for the reliable computation of the parity function by means of a network with noisy gates. This is the same as the main result in [1], except that the analysis therein seems to be not entirely correct. t Department of Computer Science, University of British Columbia, Vancouver, British Columbia V6T 1W5, Canada. Research suppo...
متن کاملLecture 20 : Redundancy Lower Bound , Sequential Prediction
where for iid processes the number of parameters is |X | − 1. Using the redundancy-capacity theorem, we will show that these 2 methods achieve the asymptotic minimax rates. In order to do so, we will find a lower bound for the capacity of a channel (as described in previous lecture) which is same as the minimax redundancy, and show that it is of the same order as the maximum redundancy achieved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2021
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2020.09.011